SCMA Codebook Design Based on Uniquely Decomposable Constellation Groups

نویسندگان

چکیده

Sparse code multiple access (SCMA), which helps improve spectrum efficiency (SE) and enhance connectivity, has been proposed as a non-orthogonal (NOMA) scheme for 5G systems. In SCMA, codebook design determines system overload ratio detection performance at receiver. this paper, an SCMA approach is based on uniquely decomposable constellation group (UDCG). We show that there are N+1 ( N ≥ 1) constellations in the UDCG, each of M (M 2) points. These allocated to users sharing same resource. Combining resources user, we can obtain UDCG-based sets. Bit error (BER) will be discussed terms coding gain maximization with superimposed codebooks. Simulation results demonstrate resource large minimum Euclidean distance (MED) meets decodable constraint. Thus, BER outperforms existing schemes both uncoded coded systems, especially large-size

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SCMA with Low Complexity Symmetric Codebook Design for Visible Light Communication

Abstract—Sparse code multiple access (SCMA) is attracting significant research interests currently, which is considered as a promising multiple access technique for 5G systems. It serves as a good candidate for the future communication network with massive nodes due to its capability of handling user overloading. Introducing SCMA to visible light communication (VLC) can provide another opportun...

متن کامل

2d Constellation Design Based on Geometric Z

In this paper we propose 2D constellation design based on geometric lattice for circularly symmetric sources as it allows easier performance evaluation. Geometric Z lattice quantization of Gaussian source is analyzed. Constellation design provides lower energy for the same error probability. It enables more efficient data transmission and energy saving for wireless systems. The exact error prob...

متن کامل

Computable Completely Decomposable Groups

A completely decomposable group is an abelian group of the form ⊕ i Hi, where Hi ≤ (Q,+). We show that every computable completely decomposable group is ∆5-categorical. We construct a computable completely decomposable group which is not ∆4-categorical, and give an example of a computable completely decomposable group G which is ∆4-categorical but not ∆3-categorical. We also prove that the inde...

متن کامل

Codebook Design of Keyblock Based Image Retrieval

This paper presents an image retrieval method based on keyblocks combing with interest points, furthermore the generation of codebook is also utilized to enhance the retrieval performance, where the balance between the retrieved precision and time cost can decide the codebook size of this CBIR system. Finally, the proposed method is compared with the method that only depends on interest points ...

متن کامل

The property of kk-colourable graphs is uniquely decomposable

An additive hereditary graph property is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. If P1, . . . ,Pn are graph properties, then a (P1, . . . ,Pn)-decomposition of a graph G is a partition E1, . . . , En of E(G) such that G[Ei], the subgraph of G induced by Ei, is in Pi, for i = 1, . . . , n. The sum of the properties P1, . . . ,Pn is the property P1 ⊕ · ·...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Wireless Communications

سال: 2021

ISSN: ['1536-1276', '1558-2248']

DOI: https://doi.org/10.1109/twc.2021.3062613